Tied monoids
نویسندگان
چکیده
We construct certain monoids, called tied monoids. These monoids result to be semidirect products finitely presented and commonly built from braid groups their relatives acting on of set partitions. The nature our indicate that they should give origin new knot algebras; indeed, include the monoid singular monoid, which were used, respectively, polynomial invariants for classical links links. Consequently, we provide a mechanism attach an algebra each monoid; this not only captures known generalizations bt-algebra, but also produces possible algebras. To build it is necessary have presentations partition types A, B D, among others. For type A use presentation due FitzGerald other was them.
منابع مشابه
Garside monoids vs divisibility monoids
Divisibility monoids (resp. Garside monoids) are a natural algebraic generalization of Mazurkiewicz trace monoids (resp. spherical Artin monoids), namely monoids in which the distributivity of the underlying lattices (resp. the existence of common multiples) is kept as an hypothesis, but the relations between the generators are not supposed to necessarily be commutations (resp. be of Coxeter ty...
متن کاملTied dice
A generalized die is a list (x1; :::; xn) of integers. For integers n 1, a b and s let D(n; a; b; s) be the set of all dice with a x1 ::: xn b and P xi = s. Two dice X and Y are tied if the number of pairs (i; j) with xi < yj equals the number of pairs (i; j) with xi > yj . We prove the following: with one exception (unique up to isomorphism), if X 6= Y 2 D(n; a; b; s) are tied dice neither of ...
متن کاملOrdered monoids and J-trivial monoids
In this paper we give a new proof of the following result of Straubing and Thérien: every J -trivial monoid is a quotient of an ordered monoid satisfying the identity x ≤ 1. We will assume in this paper that the reader has a basic background in finite semigroup theory (in particular, Green’s relations and identities defining varieties) and in computer science (languages, trees, heaps). All semi...
متن کاملParameters Tied to Treewidth
Treewidth is a graph parameter of fundamental importance to algorithmic and structural graph theory. This article surveys several graph parameters tied to treewidth, including separation number, tangle number, well-linked number, and Cartesian tree product number. We review many results in the literature showing these parameters are tied to treewidth. In a number of cases we also improve known ...
متن کاملCartesian Monoids
The Cartesian monoid of partial piecewise shift operators is developed as a model for programming systems such as Backus’ FP. Special attention is paid to those elements which are equationally implicitly definable.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Semigroup Forum
سال: 2021
ISSN: ['0037-1912', '1432-2137']
DOI: https://doi.org/10.1007/s00233-021-10212-y